Fast Karnough Map for Simplification of Complex Boolean Functions
نویسنده
چکیده
In this paper a new fast simplification method is presented. Such method realizes karnough map with large number of variables. In order to accelerate the operation of the proposed method, a new approach for fast detection of group of ones is presented. Such approach implemented in the frequency domain. The search operation relies on performing cross correlation in the frequency domain rather than time one. It is proved mathematically and practically that the number of computation steps required for the presented method is less than that needed by conventional cross correlation. Simulation results using MATLAB confirm the theoretical computations. Keywords— Boolean Functions, Simplification, Cross Correlation, Frequency Domain.
منابع مشابه
Integrating Fast Karnough Map and Modular Neural Networks for Simplification and Realization of Complex Boolean Functions
In this paper a new fast simplification method is presented. Such method realizes Karnough map with large number of variables. In order to accelerate the operation of the proposed method, a new approach for fast detection of group of ones is presented. Such approach implemented in the frequency domain. The search operation relies on performing cross correlation in the frequency domain rather th...
متن کاملIntegrating Fast Karnough Map and Modular Neural Networks for Simplification and Realization of Complex Boolean Functions
In this paper a new fast simplification method is presented. Such method realizes Karnough map with large number of variables. In order to accelerate the operation of the proposed method, a new approach for fast detection of group of ones is presented. Such approach implemented in the frequency domain. The search operation relies on performing cross correlation in the frequency domain rather th...
متن کاملMicrosoft Word - A semi pad
In this paper a new fast simplification method is presented. Such method realizes Karnough map with large number of variables. In order to accelerate the operation of the proposed method, a new approach for fast detection of group of ones is presented. Such approach implemented in the frequency domain. The search operation relies on performing cross correlation in the frequency domain rather th...
متن کاملA Fast Computerized Method For Automatic Simplification of Boolean Functions
This paper introduces a new fast systematic method for minimization of the Boolean functions. This method is a very simple because there is no need for any visual representation such as Karnough map or arrangement technique such as Tabulation method and is very easy for programming. Furthermore, it is very suitable for boolean function with large number of variables (more than 4 variable). In a...
متن کاملAِ New Technique for Realization of Boolean Functions
In previous work [23,24], a fast systematic method for minimization of the Boolean functions was presented. Such method is a simple because there is no need for any visual representation such as Karnough map or arrangement technique such as Tabulation method. Furthermore, it is very easy and fast for programming. In addition, it is suitable for boolean function with large number of variables (m...
متن کامل